Computational complexity theory - PDFSEARCH.IO - Document Search Engine

Computational complexity theory
Results: 2049

#	Item
51	CS264: Homework #1 Due by the beginning of class on Wednesday, October 1, 2014 Instructions: (1) Form a group of 1-3 students. You should turn in only one write-up for your entire group. (2) Turn in your solutions at htt Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2014-09-29 11:39:15 Computational complexity theory Mathematics Applied mathematics Packing problems Operations research Algorithm Mathematical logic Theoretical computer science Online algorithm Bin packing problem Sorting algorithm Knapsack problem
52	LNCSBatch Proofs of Partial Knowledge Add to Reading List Source URL: homes.soic.indiana.edu Language: English - Date: 2016-05-12 20:00:31 Cryptography Mathematics Computational complexity theory Proof theory Zero-knowledge proof Proof of knowledge IP Soundness Distribution
53	A Polynomial-Time Approximation Scheme for Maximum Quartet Compatibility Add to Reading List Source URL: tandy.cs.illinois.edu Language: English - Date: 2015-04-08 19:35:45 Computational complexity theory Theory of computation Complexity classes NP-complete problems Combinatorial optimization Packing problems Approximation algorithms Knapsack problem NP APX
54	Efficient Optimization of Many Objectives by Approximation-Guided Evolution Markus Wagnerc,∗, Karl Bringmanna , Tobias Friedrichb , Frank Neumannc a Max-Planck-Institut f¨ Add to Reading List Source URL: people.mpi-inf.mpg.de Language: English - Date: 2016-01-03 06:48:47 Mathematical optimization Computational complexity theory Theory of computation Applied mathematics Academia Evolutionary algorithms Operations research Cybernetics Multi-objective optimization Reduction Algorithm CMA-ES
55	Online Matching: Haste makes Waste! (Full Version)∗ Yuval Emek† Shay Kutten‡ Add to Reading List Source URL: www.tik.ee.ethz.ch Language: English - Date: 2016-06-22 05:23:03 Graph theory Mathematics Computational complexity theory NP-complete problems Matching Combinatorial optimization Dominating set Vertex cover Transportation theory Distribution
56	The Complexity of Counting and Randomised Approximation Magnus Bordewich New College University of Oxford Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2003-12-08 11:12:51 Computational complexity theory Theory of computation Mathematics Complexity classes Computational problems Theoretical computer science Structural complexity theory Tutte polynomial NP Quantum computing Time complexity Reduction
57	Hoti to Construct Random Functions ODED GOLDREICH, SHAFI AND SILVIO MICALI GOLDWASSER, Add to Reading List Source URL: groups.csail.mit.edu Language: English - Date: 2003-04-15 15:57:50 Cryptography Computational complexity theory Pseudorandomness Analysis of algorithms Probabilistic complexity theory Pseudorandom function family Randomized algorithm Random number generation Pseudorandom number generator One-way function Advantage IP
58	TSPLIB in XML format To facilitate the usage of the classical TSPLIB by Gerhard Reinelt, we now offer the data of the well-known test instances also in an XML data format, both for the symmetric and the asymmetric travel Add to Reading List Source URL: www.iwr.uni-heidelberg.de Language: English - Date: 2013-06-19 04:16:58 Graph theory Mathematics Computational complexity theory NP-complete problems Graph Travelling salesman problem Vertex Cycle Hamiltonian path Graph automorphism Vertex cover
59	Unconditional lower bounds April 12, L´ aszl´ o Babai, Noam Nisan, and Mario Szegedy. Multiparty protocols and Logspace-hard pseudorandom sequences. In Proc. 21st STOC, pages 1–11. Add to Reading List Source URL: people.cs.uchicago.edu Language: English - Date: 2014-04-12 03:40:34 Communication Communication complexity Computational complexity theory Quantum complexity theory Quantum information science
60	ON THE RANDOM-SELF-REDUCIBILITY OF COMPLETE SETS JOAN FEIGENBAUMy AND LANCE FORTNOWz Add to Reading List Source URL: cs-www.cs.yale.edu Language: English - Date: 2001-10-25 12:45:35 Computational complexity theory Theory of computation Complexity classes Structural complexity theory Conjectures Probability distributions NP Polynomial hierarchy IP P versus NP problem PP P